4 research outputs found

    Hybrid Scene Compression for Visual Localization

    Full text link
    Localizing an image wrt. a 3D scene model represents a core task for many computer vision applications. An increasing number of real-world applications of visual localization on mobile devices, e.g., Augmented Reality or autonomous robots such as drones or self-driving cars, demand localization approaches to minimize storage and bandwidth requirements. Compressing the 3D models used for localization thus becomes a practical necessity. In this work, we introduce a new hybrid compression algorithm that uses a given memory limit in a more effective way. Rather than treating all 3D points equally, it represents a small set of points with full appearance information and an additional, larger set of points with compressed information. This enables our approach to obtain a more complete scene representation without increasing the memory requirements, leading to a superior performance compared to previous compression schemes. As part of our contribution, we show how to handle ambiguous matches arising from point compression during RANSAC. Besides outperforming previous compression techniques in terms of pose accuracy under the same memory constraints, our compression scheme itself is also more efficient. Furthermore, the localization rates and accuracy obtained with our approach are comparable to state-of-the-art feature-based methods, while using a small fraction of the memory.Comment: Published at CVPR 201

    Implementaci贸n de controles para el aseguramiento de la calidad e inocuidad en bodegas fr铆as, contenedores y sala de transformaci贸n de carne de ave en GRUPO BUENA S.A., Guatemala C.A.

    Get PDF
    El presente trabajo de investigaci贸n se realiz贸 en la Empres Grupo Buena S.A. de Guatemala. Mediante el diagn贸stico, se estableci贸 la situaci贸n actual de la empresa, y la necesidad m谩s urgente de atender era la realizaci贸n de un manual que establezca los seis procedimientos para una mejor aplicaci贸n mediante la secuencia de procesos para el manejo de los productos congelados. Los procedimientos por orden de presentaci贸n son: ingreso, almacenaje, control y despacho de producto congelado y finaliza con el procedimiento de seguridad e higiene en cuartos fr铆os y el procedimiento para manejo correcto de bodegas fr铆as y contenedores fijos. Se describe la documentaci贸n de las buenas pr谩cticas de manufactura realizadas en la sala de transformaci贸n de carne de aves, para organizar la informaci贸n y que pueda servir como evidencia de que fue lo que se realiz贸, porqu茅 se hizo, qui茅n lo hizo y qu茅 proceso est谩 bajo control. Se realiz贸 iniciando con la descripci贸n del listado de insumos, materias primas, materiales de empaque y etiquetas, continuando con el programa de control de agua potable, programa de limpieza y desinfecci贸n y registros correspondientes. Se describe la fase de investigaci贸n del plan de ahorro del consumo de agua en la empresa Grupo Buena. Iniciando con el diagn贸stico donde se determin贸 la situaci贸n actual de la empresa en cuanto al consumo de agua en metros c煤bicos, continuando con la determinaci贸n de la cantidad de agua utilizada en diferentes 谩reas de la empresa, total de agua utilizada y por 煤ltimo se presenta el plan de reducci贸n de consumo de agua

    Hybrid scene Compression for Visual Localization

    No full text
    Localizing an image w.r.t. a 3D scene model represents a core task for many computer vision applications. An increasing number of real-world applications of visual localization on mobile devices, e.g., Augmented Reality or autonomous robots such as drones or self-driving cars, demand localization approaches to minimize storage and bandwidth requirements. Compressing the 3D models used for localization thus becomes a practical necessity. In this work, we introduce a new hybrid compression algorithm that uses a given memory limit in a more effective way. Rather than treating all 3D points equally, it represents a small set of points with full appearance information and an additional, larger set of points with compressed information. This enables our approach to obtain a more complete scene representation without increasing the memory requirements, leading to a superior performance compared to previous compression schemes. As part of our contribution, we show how to handle ambiguous matches arising from point compression during RANSAC. Besides outperforming previous compression techniques in terms of pose accuracy under the same memory constraints, our compression scheme itself is also more efficient. Furthermore, the localization rates and accuracy obtained with our approach are comparable to state-of-the-art feature-based methods, while using a small fraction of the memory
    corecore